Deciding separability with a fixed error

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deciding Piecewise Testable Separability for Regular Tree Languages

The piecewise testable separability problem asks, given two input languages, whether there exists a piecewise testable language that contains the first input language and is disjoint from the second. We prove a general characterisation of piecewise testable separability on languages in a well-quasiorder, in terms of ideals of the ordering. This subsumes the known characterisations in the case o...

متن کامل

Separability in the fixed part of multilevel models

Separability in ordinary regression is achieved by partitioning the set of explanatory variables into mutually orthogonal subsets. The coefficient vector of each subset is separate: its estimate depends only on the response and on the explanatory variable scores of the subset. The feasibility of formulating multilevel models with subsets of separate parameters in the fixed part is discussed. Ge...

متن کامل

The complexity of deciding whether a graph admits an orientation with fixed weak diameter

An oriented graph −→ G is said weak (resp. strong) if, for every pair {u, v} of vertices of −→ G , there are directed paths joining u and v in either direction (resp. both directions). In case, for every pair of vertices, some of these directed paths have length at most k, we call −→ G k-weak (resp. k-strong). We consider several problems asking whether an undirected graph G admits orientations...

متن کامل

Deciding Fixed and Non--xed Size Bit-vectors

We develop a new, eecient, and compact decision procedure for xed size bit-vectors with bit-wise boolean operations. The algorithm is designed such that it can also decide some common cases of parameterized (non-xed) size. To handle even more parameterized cases for bit-vectors without bit-wise boolean operations we devise a uniication based algorithm which invokes the rst algorithm symbolicall...

متن کامل

Testing Additive Separability of Error Term in Nonparametric Structural Models

This paper considers testing additive error structure in nonparametric structural models, against the alternative hypothesis that the random error term enters the nonparametric model non-additively. We propose a test statistic under a set of identification conditions considered by Hoderlein, Su and White (2012), which require the existence of a control variable such that the regressor is indepe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physics Letters A

سال: 2004

ISSN: 0375-9601

DOI: 10.1016/j.physleta.2004.07.059